Substitution Tree Indexing
نویسنده
چکیده
The performance of a theorem prover crucially depends on the speed of the basic retrieval operations, such as finding terms that are unifiable with (instances of, or more general than) a given query term. In this paper a new indexing method is presented, which outperforms traditional methods such as path indexing, discrimination tree indexing and abstraction trees. Additionally, the new index not only supports term indexing but also provides maintenance and efficient retrieval of substitutions. As confirmed in multiple experiments, substitution trees combine maximal search speed and minimal memory requirements.
منابع مشابه
Layout-based substitution tree indexing and retrieval for mathematical expressions
We introduce a new system for layout-based (LTEX) indexing and retrieving mathematical expressions using substitution trees. Substitution trees can efficiently store and find expressions based on the similarity of their symbols, symbol layout, sub-expressions and size. We describe our novel design and some of our contributions to the substitution tree indexing and retrieval algorithms. We provi...
متن کاملAdvanced Indexing Operations on Substitution Trees
Indexing techniques support the retrieval and maintenance of large sets of terms There is also an indexing method called substi tution tree indexing that e ciently handles sets of substitutions We present three advanced indexing operations for substitution trees The multi merge for the simultaneous uni cation of sets of substitutions the subsumption operation on two sets of substitutions and th...
متن کاملAn Empirical Study of Term Indexing in the Darwin Implementation of the Model Evolution Calculus
The Model Evolution calculus by Baumgartner and Tinelli lifts to first order logic the DPLL procedure that has been very successfully employed for propositional logic. The Darwin solver is the first implementation of the Model Evolution calculus and, as with any new implementation, once core functionality is in place the process of incremental improvement begins. This report details our effort ...
متن کاملContext Trees
Indexing data structures have a crucial impact on the performance of automated theorem provers. Examples are discrimination trees, which are like tries where terms are seen as strings and common prefixes are shared, and substitution trees, where terms keep their tree structure and all common contexts can be shared. Here we describe a new indexing data structure, called context trees, where, by ...
متن کاملTabling for Higher-Order Logic Programming
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-computation and re-using its result later. In particular, we focus on the table design and table access in the higher-order setting where many common operations are undecidable in general. To achieve a space and time effici...
متن کامل